
#include <stdio.h>
int main()
{
	int a[10] = { 10,2,5,8,9,2,0,6,7,3 };
	int n = 0;
	void sort(int* input, int n);
	n = sizeof(a) / sizeof(a[0]);

	sort( a, n);
	int i = 0;
	for (i = 0; i < n; i++)
	{
		printf("%d ", *(a + i));
	}
	printf("\n");
	return 0;
}
 void sort(int* input, int n)
{
	 int i = 0;
	 int t = 0;
	 int k = 0;//min
	 int j = 0;
	 for (i = 0; i < n-1; i++)
	 {
		 k = i;
		 for (j = i + 1; j < n; j++)
		 {
			 if (input[j] < input[k])
				 k = j;

				 t = input[k];
				 input[k] = input[i];
				 input[i] = t;
			 
		 }
	 }
}